منابع مشابه
Spatial smoothing for arrays with arbitrary geometry
The Spatial Smoothing(S.S.) technique has been proved to be effective in decorrelating coherent signals thus making MUSIC algorithm operative in a coherent interference environment. However, such scheme can only be applied to uniformly spaced linear arrays which are known to be very sensitive to the directions of arrivals(D0As) and can be used to estimate azimuth angles only. To significantly i...
متن کاملReliable and Efficient Computational Geometry Via Controlled Perturbation
Most algorithms of computational geometry are designed for the RealRAM and non-degenerate inputs. We call such algorithms idealistic. Executing an idealistic algorithm with floating point arithmetic may fail. Controlled perturbation replaces an input x by a random nearby x̃ in the δ -neighborhood of x and then runs the floating point version of the idealistic algorithm on x̃. The hope is that thi...
متن کاملFeature-preserving smoothing of point-sampled geometry
Based on noise intensity, in this paper, we propose a feature-preserving smoothing algorithm for point-sampled geometry (PSG). The noise intensity of each sample point on PSG is first measured by using a combined criterion. Based on mean shift clustering, the PSG is then clustered in terms of the local geometry-features similarity. According to the cluster to which a sample point belongs, a mov...
متن کاملBinary Consensus via Exponential Smoothing
In this paper, we reinterpret the most basic exponential smoothing equation as a model of social influence. Exponential smoothing has been used as a time-series forecasting and data filtering technique since the 1950s. The most basic exponential smoothing equation, S t+1 = (1−α)S +αX, is used to estimate the value of a series at time t+ 1, denoted by S , as a convex combination of the current e...
متن کاملOnline Linear Optimization via Smoothing
We present a new optimization-theoretic approach to analyzing Follow-the-Leader style algorithms, particularly in the setting where perturbations are used as a tool for regularization. We show that adding a strongly convex penalty function to the decision rule and adding stochastic perturbations to data correspond to deterministic and stochastic smoothing operations, respectively. We establish ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Commentarii Mathematici Helvetici
سال: 1999
ISSN: 0010-2571,1420-8946
DOI: 10.1007/s000140050093